On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme
نویسندگان
چکیده
Divide-and-Evolve (DaE) is an original “memeticization” of Evolutionary Computation and Artificial Intelligence Planning. DaE optimizes either the number of actions, or the total cost of actions, or the total makespan, by generating ordered sequences of intermediate goals via artificial evolution. The evolutionary part of DaE is based on the Evolving Objects (EO) library, and can theorically use any embedded planner. However, since the introduction of this approach only one embedded planner has been used: the temporal optimal planner CPT. In this paper, we built a new version of DaE based on time-based Atom Choice and we embarked another planner (the sub-optimal planner YAHSP) in order to test the technical robustness of the approach and to compare the impact of using an optimal planner versus using a sub-optimal planner for all kinds of planning problems.
منابع مشابه
Defining the Benefit Package of Thailand Universal Coverage Scheme: From Pragmatism to Sophistication
Benefit package is crucial for implementing universal health coverage (UHC). This editorial analyses how the benefit package of the Thai Universal Coverage Scheme (UC Scheme) evolved from an implicit comprehensive package which covered all conditions and interventions (with a few exceptions), to additional explicit positive lists. In 2002 when the Thai UC Scheme was lau...
متن کاملConfidence Intervals for Lower Quantiles Based on Two-Sample Scheme
In this paper, a new two-sampling scheme is proposed to construct appropriate confidence intervals for the lower population quantiles. The confidence intervals are determined in the parametric and nonparametric set up and the optimality problem is discussed in each case. Finally, the proposed procedure is illustrated via a real data set.
متن کاملOn Efficiency Criteria in Density Estimation
We discuss the classical efficiency criteria in density estimation and propose some variants. The context is a general density estimation scheme that contains the cases of i.i.d. or dependent random variables, in discrete or continuous time. Unbiased estimation, optimality and asymptotic optimality are considered. An example of a density estimator that satisfies some suggested criteria is given...
متن کاملDivide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Problems (TPPs). Whereas standard Memetic Algorithms use local search methods to improve the evolutionary solutions, and thus fail when the local method stops working on the complete problem, the Divide-and-Evolve approac...
متن کاملFree Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کامل